منابع مشابه
Algebraic Distance on Graphs
Abstract. Measuring the connection strength between a pair of vertices in a graph is one of the most vital concerns in many graph applications. Simple measures such as edge weights may not be sufficient for capturing the local connectivity. In this paper, we consider an iterative process that smoothes an associated value for nearby vertices, and present a measure of the connection strength (cal...
متن کاملBounds for algebraic gossip on graphs
We study the stopping times of gossip algorithms fornetwork coding. We analyze algebraic gossip (i.e., random linearcoding) and consider three gossip algorithms for informationspreading: Pull, Push, and Exchange. The stopping time ofalgebraic gossip is known to be linear for the complete graph, butthe question of determining a tight upper bound or lower boundsfor general...
متن کاملOn Cayley graphs of algebraic structures
We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree.
متن کاملLDPC Codes Based on Algebraic Graphs
In this paper we investigate correcting properties of LDPC codes obtained from families of algebraic graphs. The graphs considered in this article come from the infinite incidence structure. We describe how to construct these codes, choose the parameters and present several simulations, done by using the MAP decoder. We describe how error correcting properties are dependent on the graph structu...
متن کاملStudy of fullerenes by their algebraic properties
The eigenvalues of a graph is the root of its characteristic polynomial. A fullerene F is a 3- connected graphs with entirely 12 pentagonal faces and n/2 -10 hexagonal faces, where n is the number of vertices of F. In this paper we investigate the eigenvalues of a class of fullerene graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2015
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2014.07.037